The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This study aims to optimize the number of nodes and arcs in a constructed network employing a given criteria. For this, we subject the constructed network using the methods like Shortest Path (SP), Critical Path (CP) and Max-Flow (MF) between any pair of nodes. A set of iterative algorithms have been generated using matrix operations to meet the above requirement, which is named as Pandit’s algorithm...
We consider a few types of heuristics, namely, add-drop-interchange, Lagrangean relaxation-based and random rounding heuristics for the capacitated facility location problem. Some instances of the problem are constructed and performance, with respect to such instances, of the heuristics is studied. It is observed that, performance of the heuristics is often not satisfactory. The instances presented...
The goal of this article is to develop an optimization technique based on the splitting criterion of search region into several equal and disjoint subregions for solving the constrained optimization problems by finite interval arithmetic and interval order relations in the context of a decision maker’s point of view. This method has been applied for solving some benchmark test problems taken from...
Aggregation of constraints in a mathematical programming model is the process of replacing a set of constraints in the model by a single new constraint obtained from a combination of constraints in the set. It is generally believed that if such an aggregation step can be carried out without changing the set of feasible solutions of the problem, then it is highly desirable as it reduces the number...
This paper presents two approaches for solving both the minimax and minisum location problems and as well as a bi-objective location problem. The bi-objective location problem is a combination of both minimax and minisum location problems with recti-linear distances and randomly distributed destinations. Wesolowsky. G.O. [Journal of Regional Science 18: 53–60, 1977] has considered the stochastic extension...
In this paper, we consider a single server Markovian queueing system with a finite buffer. In addition to a Poisson stream of positive arrivals we assume that there is a also a Poisson stream of negative arrivals into the system. These negative arrivals which may be called as catastrophes may occur at any instant of time, whether the server is idle or busy. The time dependent performance measures...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.